An Approximation of Surprise Index as a Measure of Confidence
نویسندگان
چکیده
Probabilistic graphical models, such as Bayesian networks, are intuitive and theoretically sound tools for modeling uncertainty. A major problem with applying Bayesian networks in practice is that it is hard to judge whether a model fits well a case that it is supposed to solve. One way of expressing a possible dissonance between a model and a case is the surprise index, proposed by Habbema, which expresses the degree of surprise by the evidence given the model. While this measure reflects the intuition that the probability of a case should be judged in the context of a model, it is computationally intractable. In this paper, we propose an efficient way of approximating the surprise index.
منابع مشابه
Surprise-modulated belief update: how to learn within changing environments?
Abstract I We propose a new framework for surprise-driven learning that can be used for modeling how humans and animals learn in changing environments. It approximates optimal Bayesian learner, but with significantly reduced computational complexity. I This framework consists of two components: (i) a confidence-adjusted surprise measure to capture environmental statistics as well as subjective ...
متن کاملSplenogonadal Fusion Associated with Bilateral Cryptorchidism, Presenting as an Operative Surprise - Report of a Case
Splenogonadal fusion is a rare entity with approximately 150 reported cases until the year 2005. The entity is a rare congenital anomaly in which there is fusion of splenic and gonadal anlagen or mesonephric derivatives. Splenogonadal fusion has two continuous and discontinuous types. About ten cases have been reported to be associated with bilateral cryptorchidism in literature. Very few cases...
متن کاملMinimizing a General Penalty Function on a Single Machine via Developing Approximation Algorithms and FPTASs
This paper addresses the Tardy/Lost penalty minimization on a single machine. According to this penalty criterion, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Besides its application in real world problems, Tardy/Lost measure is a general form for popular objective functions like weighted tardiness, late work and tardiness with reje...
متن کاملAn approximation algorithm and FPTAS for Tardy/Lost minimization with common due dates on a single machine
This paper addresses the Tardy/Lost penalty minimization with common due dates on a single machine. According to this performance measure, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Initially, we present a 2-approximation algorithm and examine its worst case ratio bound. Then, a pseudo-polynomial dynamic programming algorithm is de...
متن کاملSTRUCTURAL DAMAGE DETECTION BY MODEL UPDATING METHOD BASED ON CASCADE FEED-FORWARD NEURAL NETWORK AS AN EFFICIENT APPROXIMATION MECHANISM
Vibration based techniques of structural damage detection using model updating method, are computationally expensive for large-scale structures. In this study, after locating precisely the eventual damage of a structure using modal strain energy based index (MSEBI), To efficiently reduce the computational cost of model updating during the optimization process of damage severity detection, the M...
متن کامل